Universal Cycles for Minimum Coverings of Pairs by Triples, with Application to 2-Radius Sequences
نویسندگان
چکیده
A new ordering, extending the notion of universal cycles of Chung et al. (1992), is proposed for the blocks of k-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established for all orders. The application to the construction of short 2-radius sequences is given, along with some new 2-radius sequences found through a computer search.
منابع مشابه
Existence of incomplete resolvable minimum coverings of pairs by triples
For given positive integers u and v with u ≡ v ≡ 0 (mod 6), let IRC(u; v) denote an incomplete resolvable minimum covering of pairs by triples of order u having a hole of size v. It is proved in this paper that there exists such an IRC(u; v) if and only if u¿ 3v. c © 2003 Elsevier B.V. All rights reserved.
متن کاملOn Schur Multipliers of Pairs and Triples of Groups with Topological Approach
In this paper, using a relation between Schur multipliers of pairs and triples of groups, the fundamental group and homology groups of a homotopy pushout of Eilenberg-MacLane spaces, we present among other things some behaviors of Schur multipliers of pairs and triples with respect to free, amalgamated free, and direct products and also direct limits of groups with topological approach.
متن کاملALGEBRAS WITH CYCLE-FINITE STRONGLY SIMPLY CONNECTED GALOIS COVERINGS
Let $A$ be a nite dimensional $k-$algebra and $R$ be a locally bounded category such that $R rightarrow R/G = A$ is a Galois covering dened by the action of a torsion-free group of automorphisms of $R$. Following [30], we provide criteria on the convex subcategories of a strongly simply connected category R in order to be a cycle- nite category and describe the module category of $A$. We p...
متن کاملGood coverings of Hamming spaces with spheres
The covering radius problem has been considered by many authors (e.g. [ 1, 5, 61). Finally, let t(n, k) be the minimum possible covering radius for an (n, k) code and k(n, p) the minimum possible dimension of a code with covering radius p. The study of t(n, k) was initiated by Karpovsky. For a survey of these questions, see ]41. The main goal of this paper is to find good linear coverings. The ...
متن کاملThe Doyen Wilson Theorem for Minimum Coverings with Triples
In this article necessary and sufficient conditions are found for aminimum covering ofKm with triples to be embedded in a minimum covering ofKn with triples. c © 1997 JohnWiley & Sons, Inc. J Combin Designs 5: 341–352, 1997
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 81 شماره
صفحات -
تاریخ انتشار 2012